A construction of the McLaughlin graph from the Hoffman-Singleton graph
نویسنده
چکیده
In this paper, we give a new construction of the McLaughlin graph from the Hoffman-Singleton graph.
منابع مشابه
The graphs of Hoffman-Singleton, Higman-Sims, McLaughlin and the Hermite curve of degree 6 in characteristic 5
We construct the graphs of Hoffman-Singleton, Higman-Sims and McLaughlin from certain relations on the set of non-singular conics totally tangent to the Hermitian curve of degree 6 in characteristic 5. We then interpret this geometric construction in terms of the subgroup structure of the automorphism group of this Hermitian curve.
متن کاملOn the Graphs of Hoffman-Singleton and Higman-Sims
We propose a new elementary definition of the Higman-Sims graph in which the 100 vertices are parametrised with Z4 × Z5 × Z5 and adjacencies are described by linear and quadratic equations. This definition extends Robertson’s pentagonpentagram definition of the Hoffman-Singleton graph and is obtained by studying maximum cocliques of the Hoffman-Singleton graph in Robertson’s parametrisation. Th...
متن کاملAutomatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices
The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...
متن کاملGirth 5 graphs from relative difference sets
We consider the problem of construction of graphs with given degree k and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G. Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by...
متن کاملThe Hoffman-Singleton Graph and its Automorphisms
We describe the Hoffman-Singleton graph geometrically, showing that it is closely related to the incidence graph of the affine plane over Z5. This allows us to construct all automorphisms of the graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 52 شماره
صفحات -
تاریخ انتشار 2012